An Algebraic Framework of Weighted Directed Graphs

نویسنده

  • PHILIPPE LEROUX
چکیده

We show that an algebraic formulation of weighted directed graphs leads to introducing a k-vector space equipped with two coproducts ∆ and˜∆ verifying the so-called coassociativity breaking equation (˜ ∆ ⊗ id)∆ = (id ⊗∆) ˜ ∆. Such a space is called an L-coalgebra. Explicit examples of such spaces are constructed and links between graph theory and coassociative coalgebras are given. 1. Introduction. On the one hand, motivated by periodicity phenomena in algebraic K-theory, Loday [12] introduced the notion of " noncommutative Lie algebra, " called Leibniz algebra. Such algebras D are described by a bracket [−,z] verifying the Leibniz identity:

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mathematical Morphology and Eikonal Equations on Graphs for Nonlocal Image and Data Processing

Mathematical morphology (MM) offers a wide range of operators to address various image processing problems. These operators can be defined in terms of algebraic (discrete) sets or as partial differential equations (PDEs). In this paper, we introduce a novel formulation of MM formalized as a framework of partial difference equations (PdEs) over weighted graphs of arbitrary topology. Then, we pre...

متن کامل

Independent domination in directed graphs

In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...

متن کامل

On independent domination numbers of grid and toroidal grid directed graphs

A subset $S$ of vertex set $V(D)$ is an {em indpendent dominating set} of $D$ if $S$ is both an independent and a dominating set of $D$. The {em indpendent domination number}, $i(D)$ is the cardinality of the smallest independent dominating set of $D$. In this paper we calculate the independent domination number of the { em cartesian product} of two {em directed paths} $P_m$ and $P_n$ for arbi...

متن کامل

Se p 20 07 An equivalence of categories motivated by weighted directed graphs

In a previous work, we gave a coalgebraic framework of directed graphs equipped with weights (or probability vectors) in terms of (Markov) L-coalgebras. They are K-vector spaces equipped with two co-operations, ∆M , ∆̃M verifying, (∆̃M ⊗ id)∆M = (id⊗∆M)∆̃M . In this paper, we study the category of L-algebras (dual of L-coalgebras), prove that the free L-algebra on one generator is constructed over...

متن کامل

Directed prime graph of non-commutative ring

Prime graph of a ring R is a graph whose vertex set is the whole set R any any two elements $x$ and $y$ of $R$ are adjacent in the graph if and only if $xRy = 0$ or $yRx = 0$.  Prime graph of a ring is denoted by $PG(R)$. Directed prime graphs for non-commutative rings and connectivity in the graph are studied in the present paper. The diameter and girth of this graph are also studied in the pa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003